Programming complexity - PDFSEARCH.IO - Document Search Engine

Programming complexity
Results: 456

#	Item
341	Polymorphic Time Systems for Estimating Program Complexity Vincent Dornic 1 2 ; Pierre Jouvelot 1 3 Add to Reading List Source URL: www.psrg.csail.mit.edu Language: English - Date: 2013-07-14 14:56:24 Type theory Data types Theoretical computer science Lambda calculus Formal methods Type system Programming language Fixed-point combinator Recursive data type Software engineering Computing Programming language theory
342	Chapter 8: Cuts and Metrics (cp. Williamson & Shmoys, Chapter[removed] Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2013-02-12 17:19:22 Linear programming relaxation Mathematics Applied mathematics Theoretical computer science Approximation algorithm Computational complexity theory
343	Approximation Algorithms (ADM III) Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-12-12 06:04:13 NP-complete problems Combinatorial optimization Graph coloring Probabilistic complexity theory Algorithms Semidefinite programming Randomized algorithm Approximation algorithm Randomized rounding Theoretical computer science Mathematics Applied mathematics
344	Chapter 5: Random Sampling and Randomized Rounding of Linear Programs (cp. Williamson & Shmoys, Chapter 5) Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-12-07 05:55:26 Combinatorial optimization Computational complexity theory Analysis of algorithms NP-complete problems Algorithms Linear programming relaxation Randomized rounding Randomized algorithm Maximum cut Theoretical computer science Applied mathematics Mathematics
345	Chapter 8: Cuts and Metrics (cp. Williamson & Shmoys, Chapter[removed] Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2013-01-30 08:55:10 Approximation algorithm Computational complexity theory Linear programming relaxation Mathematics Applied mathematics Combinatorial optimization Linear programming Theoretical computer science
346	Chapter 3: Rounding Data and Dynamic Programming (cp. Williamson & Shmoys, Chapter[removed] Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-28 07:19:03 Operations research Complexity classes Mathematical optimization Approximation algorithms Job shop scheduling Polynomial-time approximation scheme Knapsack problem Optimization problem Dynamic programming Theoretical computer science Computational complexity theory Applied mathematics
347	Approximation Algorithms (ADM III) Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-28 07:19:02 NP-complete problems NP-complete Set cover problem Vertex cover Approximation algorithm Greedy algorithm P versus NP problem NP Linear programming Theoretical computer science Computational complexity theory Mathematics
348	Chapter 3: Rounding Data and Dynamic Programming (cp. Williamson & Shmoys, Chapter[removed] Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-23 06:22:49 Complexity classes NP-complete problems Operations research Mathematical optimization Bin packing problem Polynomial-time approximation scheme Job shop scheduling Knapsack problem Strongly NP-complete Theoretical computer science Computational complexity theory Applied mathematics
349	Approximation Algorithms (ADM III) Martin Skutella TU Berlin WS[removed] Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-28 07:19:02 NP-complete problems Complexity classes Operations research Combinatorial optimization Approximation algorithm Linear programming relaxation Set cover problem Polynomial-time approximation scheme Optimization problem Theoretical computer science Computational complexity theory Applied mathematics
350	Approximation Algorithms (ADM III) Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-29 13:39:05 Algorithms Combinatorial optimization Probabilistic complexity theory Randomized rounding Linear programming relaxation Randomized algorithm Mathematics Applied mathematics Theoretical computer science

UPDATE